Theory of Provable Recursive Functions
نویسنده
چکیده
منابع مشابه
Functional interpretation and the existence property
Stephen C. Kleene [7] introduced the notion of realisability for analysing the relation between intuitionism and the theory of recursive functions. In particular he was able to show that intuitionistic number theory is closed under a (weak) Church rule: If ∀x∃yA(x, y) is provable, then there is a recursive function f such that for every natural number n, A(n, f(n) ) is provable. Using this it w...
متن کاملProvably Total Functions of Arithmetic with Basic Terms
This paper presents a new characterization of provably recursive functions of first-order arithmetic. We consider functions defined by sets of equations. The equations can be arbitrary, not necessarily defining primitive recursive, or even total, functions. The main result states that a function is provably recursive iff its totality is provable (using natural deduction) from the defining set o...
متن کاملFuzzy type theory with partial functions
This paper is a study of fuzzy type theory (FTT) with partial functions. Out of several possibilities we decided tointroduce a special value ”∗” that represents ”undefined”. In the interpretation of FTT, this value lays outside of thecorresponding domain. In the syntax it can be naturally represented by the description operator acting on the empty(fuzzy) set, because choosing an element from it...
متن کاملUnavoidable sequences in constructive analysis
Kleene’s formalization FIM of intuitionistic analysis ([3] and [2]) includes bar induction, countable and continuous choice, but is consistent with the statement that there are no non-recursive functions ([5]). Veldman ([12]) showed that in FIM the constructive analytical hierarchy collapses at Σ 2 . These are serious obstructions to interpreting the constructive content of classical analysis, ...
متن کاملArithmetical Foundations - Recursion. Evaluation. Consistency
Recursive maps, nowadays called primitive recursive maps, PR maps, have been introduced by Gödel in his 1931 article for the arithmetisation, gödelisation, of metamathematics. For construction of his undecidable formula he introduces a nonconstructive, non-recursive predicate beweisbar, provable. Staying within the area of categorical free-variables theory PR of primitive recursion or appropria...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010